On the Proof Theory of Program Transformations
نویسنده
چکیده
§1 Abstract We provide an intensional semantics for certain elementary program transformations by describing a translation from these transformations to the derivations of a simple theory of operations and types and we show that this semantics is intensionally faithful. Our objective is to understand more precisely the intensional structure of a class of semi-formal program derivations.
منابع مشابه
A Study on Properties of Dempster-Shafer Theory to Probability Theory transformations
In this paper, five conditions that have been proposed by Cobb and Shenoy are studied for nine different mappings from the Dempster-Shafer theory to the probability theory. After comparing these mappings, one of the considerable results indicates that none of the mappings satisfies the condition of invariance with respect to the marginalization process. In more details, the main reason for this...
متن کاملHerbrand’s theorem and extractive proof theory
Proof theory has its historic origin in foundational issues centered around (relative) consistency proofs (Hilbert’s program). Since the 1950’s Georg Kreisel pushed for a shift of emphasis in proof theory towards the use of proof theoretic transformations (as developed in the course of Hilbert’s program) to analyze given proofs P e.g. of ineffectively proved ∀∃-statements C with the aim to extr...
متن کاملProgram Transformation and Proof Transformation
A "linear style" sequent calculus makes it possible to explore the close structural relationships between primitive recursive programs and their inductive termination proofs, and between program transformations and their corresponding proof transformations. In this context the recursive to tail recursive transformation corresponds proof theoretically to a certain kind of cut elimination, called...
متن کاملTowards a Logic for Reasoning About Logic Programs Transformation
We give a proof-theoretic analysis of logic programs transformations , viewed as operations on proof trees in the sense of 3, 4, 9, 10]. We present a logic for reasoning about (equivalence preserving) transformations of logic programs. Our main tool is the usage of inference rules; the target program may be obtained as a set of clause introduction proofs with axioms from the source program. The...
متن کاملFoundations for a Practical Theory of Program Refinement and Transformation
A wide spectrum language is presented, which is designed to facilitate the proof of the correctness of refinements and transformations. Two different proof methods are introduced and used to prove some fundamental transformations, including a general induction rule (Lemma 3.9) which enables transformations of recursive and iterative programs to be proved by induction on their finite truncations...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 3 شماره
صفحات -
تاریخ انتشار 1995